A Report on Approximate Graph Coloring by Semidefinite Programming
نویسندگان
چکیده
In this report, some results on semidefinite programming relaxation of graph coloring are summarized. Two algorithms on semicoloring/coloring are described in detail for 3-colorable graphs. The relation between semidefinite programming relaxation and the Lovász theta function is simply introduced.
منابع مشابه
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs
The essential part of the best known approximation algorithm for graph MAXCUT is approximately solving MAXCUT’s semidefinite relaxation. For a graph with n nodes and m edges, previous work on solving its semidefinite relaxation for MAXCUT requires space Õ(n). Under the assumption of exact arithmetic, we show how an approximate solution can be found in space O(m + n), where O(m) comes from the i...
متن کاملParallel Jobs Scheduling with a Specific Due Date: Asemi-definite Relaxation-based Algorithm
This paper considers a different version of the parallel machines scheduling problem in which the parallel jobs simultaneously requirea pre-specifiedjob-dependent number of machines when being processed.This relaxation departs from one of the classic scheduling assumptions. While the analytical conditions can be easily statedfor some simple models, a graph model approach is required when confli...
متن کاملApproximation Algorithms for Semidefinite Packing Problems with Applications to Maxcut and Graph Coloring
We describe the semidefinite analog of the vector packing problem, and show that the semidefinite programming relaxations for Maxcut [10] and graph coloring [16] are in this class of problems. We extend a method of Bienstock and Iyengar [4] which was based on ideas from Nesterov [24] to design an algorithm for computing 2-approximate solutions for this class of semidefinite programs. Our algori...
متن کامل1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN
The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...
متن کاملSemidefinite programming relaxations for graph coloring and maximal clique problems
The semidefinite programming formulation of the Lovász theta number does not only give one of the best polynomial simultaneous bounds on the chromatic number χ(G) or the clique number ω(G) of a graph, but also leads to heuristics for graph coloring and extracting large cliques. This semidefinite programming formulation can be tightened toward either χ(G) or ω(G) by adding several types of cutti...
متن کامل